SherbyNet - /page/wikibook/entry.mu

Micron Document

<!DOCTYPE html>

<title>Protocol ossification</title>

</head>

Protocol ossification

</h1>

</header>

Protocol ossification is the loss of flexibility, <a href="Extensibility" title="Extensibility">extensibility</a> and evolvability of <a href="Network_protocols" class="mw-redirect" title="Network protocols">network protocols</a>. This is largely due to <a href="Middlebox" title="Middlebox">middleboxes</a> that are sensitive to the <a href="Wire_image_(networking)" class="mw-redirect" title="Wire image (networking)">wire image</a> of the protocol, and which can interrupt or interfere with messages that are valid but which the middlebox does not correctly recognise. This is a violation of the <a href="End-to-end_principle" title="End-to-end principle">end-to-end principle</a>. Secondary causes include inflexibility in endpoint implementations of protocols.

Ossification is a major issue in <a href="Internet" title="Internet">Internet</a> protocol design and deployment, as it can prevent new protocols or extensions from being deployed on the Internet, or place strictures on the design of new protocols; new protocols may have to be <a href="Encapsulation_(networking)" title="Encapsulation (networking)">encapsulated</a> in an already-deployed protocol or mimic the wire image of another protocol. Because of ossification, the <a href="Transmission_Control_Protocol" title="Transmission Control Protocol">Transmission Control Protocol</a> (TCP) and <a href="User_Datagram_Protocol" title="User Datagram Protocol">User Datagram Protocol</a> (UDP) are the only practical choices for <a href="Transport_protocol" class="mw-redirect" title="Transport protocol">transport protocols</a> on the Internet, and TCP itself has significantly ossified, making extension or modification of the protocol difficult.

Recommended methods of preventing ossification include <a href="Encrypting" class="mw-redirect" title="Encrypting">encrypting</a> protocol metadata, and ensuring that extension points are exercised and wire image variability is exhibited as fully as possible; remedying existing ossification requires coordination across protocol participants. <a href="QUIC" title="QUIC">QUIC</a> is the first <a href="IETF" class="mw-redirect" title="IETF">IETF</a> transport protocol to have been designed with deliberate anti-ossification properties.

<div class="mw-heading mw-heading2"><h2 id="History">History</h2></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output .ambox{border:1px solid #a2a9b1;border-left:10px solid #36c;background-color:#fbfbfb;box-sizing:border-box}.mw-parser-output .ambox+link+.ambox,.mw-parser-output .ambox+link+style+.ambox,.mw-parser-output .ambox+link+link+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+style+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+link+.ambox{margin-top:-1px}html body.mediawiki .mw-parser-output .ambox.mbox-small-left{margin:4px 1em 4px 0;overflow:hidden;width:238px;border-collapse:collapse;font-size:88%;line-height:1.25em}.mw-parser-output .ambox-speedy{border-left:10px solid #b32424;background-color:#fee7e6}.mw-parser-output .ambox-delete{border-left:10px solid #b32424}.mw-parser-output .ambox-content{border-left:10px solid #f28500}.mw-parser-output .ambox-style{border-left:10px solid #fc3}.mw-parser-output .ambox-move{border-left:10px solid #9932cc}.mw-parser-output .ambox-protection{border-left:10px solid #a2a9b1}.mw-parser-output .ambox .mbox-text{border:none;padding:0.25em 0.5em;width:100%}.mw-parser-output .ambox .mbox-image{border:none;padding:2px 0 2px 0.5em;text-align:center}.mw-parser-output .ambox .mbox-imageright{border:none;padding:2px 0.5em 2px 0;text-align:center}.mw-parser-output .ambox .mbox-empty-cell{border:none;padding:0;width:1px}.mw-parser-output .ambox .mbox-image-div{width:52px}@media(min-width:720px){.mw-parser-output .ambox{margin:0 10%}}@media print{body.ns-0 .mw-parser-output .ambox{display:none!important}}

/* end https://en.wikipedia.org/ */

</style>

Significant ossification had set in on the <a href="Internet" title="Internet">Internet</a> by 2005, with analyses of the problem also being published in that year;<a href="#cite_note-FOOTNOTEAmmar201857-58-1">[1]</a> <a href="#CITEREFAmmar2018">Ammar (2018)</a> suggests that ossification was a consequence of the Internet attaining global scale and becoming the primary communication network.<a href="#cite_note-FOOTNOTEAmmar201859-2">[2]</a>

<a href="Multipath_TCP" title="Multipath TCP">Multipath TCP</a> was the first extension to a core Internet protocol to deeply confront protocol ossification during its design.<a href="#cite_note-FOOTNOTERaiciuPaaschBarreFord20121-3">[3]</a>

The IETF created the Transport Services (taps) working group in 2014.<a href="#cite_note-4">[4]</a> It has a mandate to mitigate ossification at the <a href="Transport_protocol" class="mw-redirect" title="Transport protocol">transport protocol</a> layer.<a href="#cite_note-5">[5]</a>

<a href="QUIC" title="QUIC">QUIC</a> is the first <a href="IETF" class="mw-redirect" title="IETF">IETF</a> transport protocol to deliberately minimise its wire image to avoid ossification.<a href="#cite_note-FOOTNOTETrammellKuehlewind20192-6">[6]</a>

The <a href="Internet_Architecture_Board" title="Internet Architecture Board">Internet Architecture Board</a> identified design considerations around the exposure of protocol information to network elements as a "developing field" in 2023.<a href="#cite_note-FOOTNOTEArkkoHardiePaulyKühlewind20233._Further_Work-7">[7]</a>

<div class="mw-heading mw-heading2"><h2 id="Causes">Causes</h2></div>

The primary cause of protocol ossification is <a href="Middlebox" title="Middlebox">middlebox</a> interference,<a href="#cite_note-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017619-8">[8]</a> invalidating the <a href="End-to-end_principle" title="End-to-end principle">end-to-end principle</a>.<a href="#cite_note-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017620-9">[9]</a> Middleboxes may entirely block unknown protocols or unrecognised extensions to known protocols, interfere with extension or feature negotiation, or perform more invasive modification of protocol metadata.<a href="#cite_note-FOOTNOTEEdelineDonnet2019171-10">[10]</a> Not all middlebox modifications are necessarily ossifying; of those which are potentially harmful, they are disproportionately towards the network edge.<a href="#cite_note-FOOTNOTEEdelineDonnet2019173-175-11">[11]</a> Middleboxes are deployed by network operators unilaterally to solve specific problems,<a href="#cite_note-FOOTNOTEEdelineDonnet2019169-12">[12]</a> including performance optimisation, security requirements (e.g., firewalls), <a href="Network_address_translation" title="Network address translation">network address translation</a> or enhancing control of networks.<a href="#cite_note-FOOTNOTEHondaNishidaRaiciuGreenhalgh20111-13">[13]</a> These middlebox deployments provide localised short-term utility but degrade the global long-term evolvability of the Internet in a manifestation of the <a href="Tragedy_of_the_commons" title="Tragedy of the commons">tragedy of the commons</a>.<a href="#cite_note-FOOTNOTEEdelineDonnet2019169-12">[12]</a>

Changes to a protocol must be tolerated by all on-path intermediaries; if wide Internet deployment of the change is desired, then this extends to a large portion of intermediaries on the Internet. A middlebox must tolerate widely used protocols as they were being used at the time of its deployment, but is liable not to tolerate new protocols or changes to extant ones, effectively creating a <a href="Vicious_cycle" class="mw-redirect" title="Vicious cycle">vicious cycle</a> as novel <a href="Wire_image_(networking)" class="mw-redirect" title="Wire image (networking)">wire images</a> cannot gain wide enough deployment to make middleboxes tolerate the new wire image across the entire Internet.<a href="#cite_note-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017620-9">[9]</a> Even all participants tolerating the protocol is no guarantee of use: in the absence of a negotiation or discovery mechanism, the endpoints may default to a protocol that is considered more reliable.<a href="#cite_note-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017621-14">[14]</a>

Beyond middleboxes, ossification can also be caused by insufficient flexibility within the endpoint's implementation. <a href="Operating_system_kernels" class="mw-redirect" title="Operating system kernels">Operating system kernels</a> are slow to change and deploy,<a href="#cite_note-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017621-14">[14]</a> and protocols implemented in hardware can also inappropriately fix protocol details.<a href="#cite_note-FOOTNOTECorbet2015-15">[15]</a> A widely used <a href="Application_programming_interface" class="mw-redirect" title="Application programming interface">application programming interface</a> (API) that makes assumptions about the operation of underlying protocols can hinder the deployment of protocols that do not share those assumptions.<a href="#cite_note-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017620-9">[9]</a>

<div class="mw-heading mw-heading2"><h2 id="Prevention_and_remediation">Prevention and remediation</h2></div>

The <a href="Internet_Architecture_Board" title="Internet Architecture Board">Internet Architecture Board</a> recommended in 2019 that implicit signals to observers should be replaced with signals deliberately intended for the consumption of those observers, and signals not intended for their consumption should not be available to them (e.g., by encryption); and also that the protocol metadata should be <a href="Message_authentication" title="Message authentication">integrity protected</a> so that it cannot be modified by middleboxes.<a href="#cite_note-FOOTNOTEHardie20197-8-16">[16]</a> However, even fully encrypted metadata may not entirely prevent ossification in the network, as the wire image of a protocol can still show patterns that come to be relied upon.<a href="#cite_note-FOOTNOTEFairhurstPerkins20217._Conclusions-17">[17]</a> Network operators use metadata for a variety of benign management purposes,<a href="#cite_note-FOOTNOTEFairhurstPerkins20212._Current_Uses_of_Transport_Headers_within_the_Network-18">[18]</a> and Internet research is also informed by data gathered from protocol metadata;<a href="#cite_note-FOOTNOTEFairhurstPerkins20213._Research,_Development,_and_Deployment-19">[19]</a> a protocol's designer must balance ossification resistance against observability for operational or research needs.<a href="#cite_note-FOOTNOTEFairhurstPerkins20217._Conclusions-17">[17]</a> <a href="#CITEREFArkkoHardiePaulyKühlewind2023">Arkko et al. (2023)</a> provides further guidance on these considerations: disclosure of information by a protocol to the network should be intentional,<a href="#cite_note-FOOTNOTEArkkoHardiePaulyKühlewind20232.1._Intentional_Distribution-20">[20]</a> performed with the agreement of both recipient and sender,<a href="#cite_note-FOOTNOTEArkkoHardiePaulyKühlewind20232.2._Control_of_the_Distribution_of_Information-21">[21]</a> authenticated to the degree possible and necessary,<a href="#cite_note-FOOTNOTEArkkoHardiePaulyKühlewind20232.3._Protecting_Information_and_Authentication-22">[22]</a> only acted upon to the degree of its trustworthiness,<a href="#cite_note-FOOTNOTEArkkoHardiePaulyKühlewind20232.5._Limiting_Impact_of_Information-23">[23]</a> and minimised and provided to a minimum number of entities.<a href="#cite_note-FOOTNOTEArkkoHardiePaulyKühlewind20232.4._Minimize_Information-24">[24]</a><a href="#cite_note-FOOTNOTEArkkoHardiePaulyKühlewind20232.6._Minimum_Set_of_Entities-25">[25]</a>

Active use of extension points is required if they are not to ossify.<a href="#cite_note-FOOTNOTEThomsonPauly20213._Active_Use-26">[26]</a> Reducing the number of extension points, documenting invariants that protocol participants can rely on as opposed to incidental details that must not be relied upon, and prompt detection of issues in deployed systems can assist in ensuring active use.<a href="#cite_note-FOOTNOTEThomsonPauly20214._Complementary_Techniques-27">[27]</a> However, even active use may only exercise a narrow portion of the protocol and ossification can still occur in the parts that remain invariant in practice despite theoretical variability.<a href="#cite_note-FOOTNOTEThomsonPauly20213.1._Dependency_Is_Better-28">[28]</a><a href="#cite_note-FOOTNOTETrammellKuehlewind20197-29">[29]</a> "Greasing" an extension point, where some implementations indicate support for non-existent extensions, can ensure that actually-existent-but-unrecognised extensions are tolerated (cf. <a href="Chaos_engineering" title="Chaos engineering">chaos engineering</a>).<a href="#cite_note-FOOTNOTEThomsonPauly20213.3._Falsifying_Active_Use-30">[30]</a> <a href="HTTP_headers" class="mw-redirect" title="HTTP headers">HTTP headers</a> are an example of an extension point that has successfully avoided significant ossification, as participants will generally ignore unrecognised headers.<a href="#cite_note-FOOTNOTEThomsonPauly20213.4._Examples_of_Active_Use-31">[31]</a>

A new protocol may be designed to mimic the wire image of an existing ossified protocol;<a href="#cite_note-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017623-32">[32]</a> alternatively, a new protocol may be <a href="Encapsulation_(networking)" title="Encapsulation (networking)">encapsulated</a> within an existing, tolerated protocol. A disadvantage of encapsulation is that there is typically overhead and redundant work (e.g., outer checksums made redundant by inner integrity checks).<a href="#cite_note-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017623-4-33">[33]</a>

Besides middleboxes, other sources of ossification can also be resisted. <a href="User-space" class="mw-redirect" title="User-space">User-space</a> implementation of protocols can lead to more rapid evolution. If the new protocol is encapsulated in UDP, then user-space implementation is possible.<a href="#cite_note-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017630-34">[34]</a><a href="#cite_note-FOOTNOTECorbet2016-35">[35]</a> Where support for protocols is uncertain, participants may simultaneously try alternative protocols, at the cost of increasing the amount of data sent.<a href="#cite_note-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017629-36">[36]</a>

With sufficient effort and coordination, ossification can be directly reversed. A <a href="Flag_day_(computing)" title="Flag day (computing)">flag day</a>, where protocol participants make changes in concert, can break the vicious cycle and establish active use. This approach was used to deploy <a href="EDNS" class="mw-redirect" title="EDNS">EDNS</a>, which had formerly not been tolerated by servers.<a href="#cite_note-FOOTNOTEThomsonPauly20213.5._Restoring_Active_Use-37">[37]</a>

<div class="mw-heading mw-heading2"><h2 id="Examples">Examples</h2></div>

The <a href="Transmission_Control_Protocol" title="Transmission Control Protocol">Transmission Control Protocol</a> has suffered from ossification.<a href="#cite_note-FOOTNOTEThomsonPauly2021A.5._TCP-38">[38]</a> One measurement found that a third of paths across the Internet encounter at least one intermediary that modifies TCP metadata, and 6.5% of paths encounter harmful ossifying effects from intermediaries.<a href="#cite_note-FOOTNOTEEdelineDonnet2019175-176-39">[39]</a> Extensions to TCP have been affected: the design of <a href="MPTCP" class="mw-redirect" title="MPTCP">MPTCP</a> was constrained by middlebox behaviour,<a href="#cite_note-FOOTNOTERaiciuPaaschBarreFord20121-3">[3]</a><a href="#cite_note-FOOTNOTEHesmansDuchenePaaschDetal20131-40">[40]</a> and the deployment of <a href="TCP_Fast_Open" title="TCP Fast Open">TCP Fast Open</a> has been likewise hindered.<a href="#cite_note-FOOTNOTERybczyńska2020-41">[41]</a><a href="#cite_note-FOOTNOTEThomsonPauly2021A.5._TCP-38">[38]</a>

The <a href="Stream_Control_Transmission_Protocol" title="Stream Control Transmission Protocol">Stream Control Transmission Protocol</a> has been little-deployed on the Internet due to intolerance from middleboxes,<a href="#cite_note-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017620-9">[9]</a> and also due to the very widespread <a href="BSD_sockets_API" class="mw-redirect" title="BSD sockets API">BSD sockets API</a> ill-fitting its capabilities.<a href="#cite_note-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017627-42">[42]</a> In practice, TCP and UDP are the only usable Internet <a href="Transport_protocol" class="mw-redirect" title="Transport protocol">transport protocols</a>.<a href="#cite_note-FOOTNOTEMcQuistinPerkinsFayed20161-43">[43]</a>

<a href="Transport_Layer_Security" title="Transport Layer Security">Transport Layer Security</a> (TLS) has experienced ossification. TLS was the original context for the introduction of greasing extension points. <a href="TLS_1.3" class="mw-redirect" title="TLS 1.3">TLS 1.3</a>, as originally designed, proved undeployable on the Internet: middleboxes had ossified the protocol's version parameter. This was discovered late in the protocol design process, during experimental deployments by <a href="Web_browsers" class="mw-redirect" title="Web browsers">web browsers</a>. As a result, version 1.3 mimics the wire image of version 1.2.<a href="#cite_note-FOOTNOTESullivan2017-44">[44]</a>

<a href="QUIC" title="QUIC">QUIC</a> has been specifically designed to be deployable, evolvable and to have anti-ossification properties;<a href="#cite_note-FOOTNOTECorbet2018-45">[45]</a> it is the first <a href="IETF" class="mw-redirect" title="IETF">IETF</a> transport protocol to deliberately minimise its wire image for these ends.<a href="#cite_note-FOOTNOTETrammellKuehlewind20192-6">[6]</a> It is greased,<a href="#cite_note-FOOTNOTEThomsonPauly20213.3._Falsifying_Active_Use-30">[30]</a> it has protocol invariants explicitly specified,<a href="#cite_note-FOOTNOTEThomson20212._Fixed_Properties_of_All_QUIC_Versions-46">[46]</a> it is encapsulated in UDP, and its protocol metadata is encrypted.<a href="#cite_note-FOOTNOTECorbet2018-45">[45]</a> Still, applications using QUIC must be prepared to fall back to other protocols, as UDP is blocked by some middleboxes.<a href="#cite_note-FOOTNOTEKühlewindTrammell20222._The_Necessity_of_Fallback-47">[47]</a>

<ul><li><a href="Backward_compatibility" title="Backward compatibility">Backward compatibility</a></li>

<li><a href="Collective_action_problem" title="Collective action problem">Collective action problem</a></li>

<li><a href="De_facto_standard" title="De facto standard">De facto standard</a></li>

<li><a href="Forward_compatibility" title="Forward compatibility">Forward compatibility</a></li>

<li><a href="Interoperability" title="Interoperability">Interoperability</a></li>

<li><a href="Hyrum's_law" class="mw-redirect" title="Hyrum's law">Hyrum's law</a></li>

<li><a href="Network_effect" title="Network effect">Network effect</a></li>

<li><a href="Robustness_principle" title="Robustness principle">Robustness principle</a></li>

<li><a href="Vendor_lock-in" title="Vendor lock-in">Vendor lock-in</a></li></ul>

<div class="mw-heading mw-heading2"><h2 id="References">References</h2></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output .reflist{margin-bottom:0.5em;list-style-type:decimal}@media screen{.mw-parser-output .reflist{font-size:90%}}.mw-parser-output .reflist .references{font-size:100%;margin-bottom:0;list-style-type:inherit}.mw-parser-output .reflist-columns-2{column-width:30em}.mw-parser-output .reflist-columns-3{column-width:25em}.mw-parser-output .reflist-columns{margin-top:0.3em}.mw-parser-output .reflist-columns ol{margin-top:0}.mw-parser-output .reflist-columns li{page-break-inside:avoid;break-inside:avoid-column}.mw-parser-output .reflist-upper-alpha{list-style-type:upper-alpha}.mw-parser-output .reflist-upper-roman{list-style-type:upper-roman}.mw-parser-output .reflist-lower-alpha{list-style-type:lower-alpha}.mw-parser-output .reflist-lower-greek{list-style-type:lower-greek}.mw-parser-output .reflist-lower-roman{list-style-type:lower-roman}

/* end https://en.wikipedia.org/ */

</style><div class="reflist">

<li id="cite_note-FOOTNOTEAmmar201857-58-1"><a href="#cite_ref-FOOTNOTEAmmar201857-58_1-0">^</a> <a href="#CITEREFAmmar2018">Ammar 2018</a>, p. 57-58.

</li>

<li id="cite_note-FOOTNOTEAmmar201859-2"><a href="#cite_ref-FOOTNOTEAmmar201859_2-0">^</a> <a href="#CITEREFAmmar2018">Ammar 2018</a>, p. 59.

</li>

<li id="cite_note-FOOTNOTERaiciuPaaschBarreFord20121-3">^ <a href="#cite_ref-FOOTNOTERaiciuPaaschBarreFord20121_3-0">a</a> <a href="#cite_ref-FOOTNOTERaiciuPaaschBarreFord20121_3-1">b</a> <a href="#CITEREFRaiciuPaaschBarreFord2012">Raiciu et al. 2012</a>, p. 1.

</li>

/* start https://en.wikipedia.org/ */

.mw-parser-output cite.citation{font-style:inherit;word-wrap:break-word}.mw-parser-output .citation q{quotes:"\"""\"""'""'"}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}.mw-parser-output .id-lock-free.id-lock-free a{background:url("./mw/Lock-green.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-limited.id-lock-limited a,.mw-parser-output .id-lock-registration.id-lock-registration a{background:url("./mw/Lock-gray-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-subscription.id-lock-subscription a{background:url("./mw/Lock-red-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .cs1-ws-icon a{background:url("./mw/Wikisource-logo.svg")right 0.1em center/12px no-repeat}body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-free a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-limited a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-registration a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-subscription a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .cs1-ws-icon a{background-size:contain;padding:0 1em 0 0}.mw-parser-output .cs1-code{color:inherit;background:inherit;border:none;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;color:var(--color-error,#d33)}.mw-parser-output .cs1-visible-error{color:var(--color-error,#d33)}.mw-parser-output .cs1-maint{display:none;color:#085;margin-left:0.3em}.mw-parser-output .cs1-kern-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right{padding-right:0.2em}.mw-parser-output .citation .mw-selflink{font-weight:inherit}@media screen{.mw-parser-output .cs1-format{font-size:95%}html.skin-theme-clientpref-night .mw-parser-output .cs1-maint{color:#18911f}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .cs1-maint{color:#18911f}}

/* end https://en.wikipedia.org/ */

</style><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://datatracker.ietf.org/wg/taps/history/">"Transport Services (taps) – Group history"</a>. <a href="IETF" class="mw-redirect" title="IETF">IETF</a>.</cite>

</li>

<li id="cite_note-5"><a href="#cite_ref-5">^</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://datatracker.ietf.org/doc/charter-ietf-taps/">"Transport Services – charter-ietf-taps-02"</a>. <a href="IETF" class="mw-redirect" title="IETF">IETF</a>.</cite>

</li>

<li id="cite_note-FOOTNOTETrammellKuehlewind20192-6">^ <a href="#cite_ref-FOOTNOTETrammellKuehlewind20192_6-0">a</a> <a href="#cite_ref-FOOTNOTETrammellKuehlewind20192_6-1">b</a> <a href="#CITEREFTrammellKuehlewind2019">Trammell & Kuehlewind 2019</a>, p. 2.

</li>

<li id="cite_note-FOOTNOTEArkkoHardiePaulyKühlewind20233._Further_Work-7"><a href="#cite_ref-FOOTNOTEArkkoHardiePaulyKühlewind20233._Further_Work_7-0">^</a> <a href="#CITEREFArkkoHardiePaulyKühlewind2023">Arkko et al. 2023</a>, 3. Further Work.

</li>

<li id="cite_note-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017619-8"><a href="#cite_ref-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017619_8-0">^</a> <a href="#CITEREFPapastergiouFairhurstRosBrunstrom2017">Papastergiou et al. 2017</a>, p. 619.

</li>

<li id="cite_note-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017620-9">^ <a href="#cite_ref-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017620_9-0">a</a> <a href="#cite_ref-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017620_9-1">b</a> <a href="#cite_ref-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017620_9-2">c</a> <a href="#cite_ref-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017620_9-3">d</a> <a href="#CITEREFPapastergiouFairhurstRosBrunstrom2017">Papastergiou et al. 2017</a>, p. 620.

</li>

<li id="cite_note-FOOTNOTEEdelineDonnet2019171-10"><a href="#cite_ref-FOOTNOTEEdelineDonnet2019171_10-0">^</a> <a href="#CITEREFEdelineDonnet2019">Edeline & Donnet 2019</a>, p. 171.

</li>

<li id="cite_note-FOOTNOTEEdelineDonnet2019173-175-11"><a href="#cite_ref-FOOTNOTEEdelineDonnet2019173-175_11-0">^</a> <a href="#CITEREFEdelineDonnet2019">Edeline & Donnet 2019</a>, p. 173-175.

</li>

<li id="cite_note-FOOTNOTEEdelineDonnet2019169-12">^ <a href="#cite_ref-FOOTNOTEEdelineDonnet2019169_12-0">a</a> <a href="#cite_ref-FOOTNOTEEdelineDonnet2019169_12-1">b</a> <a href="#CITEREFEdelineDonnet2019">Edeline & Donnet 2019</a>, p. 169.

</li>

<li id="cite_note-FOOTNOTEHondaNishidaRaiciuGreenhalgh20111-13"><a href="#cite_ref-FOOTNOTEHondaNishidaRaiciuGreenhalgh20111_13-0">^</a> <a href="#CITEREFHondaNishidaRaiciuGreenhalgh2011">Honda et al. 2011</a>, p. 1.

</li>

<li id="cite_note-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017621-14">^ <a href="#cite_ref-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017621_14-0">a</a> <a href="#cite_ref-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017621_14-1">b</a> <a href="#CITEREFPapastergiouFairhurstRosBrunstrom2017">Papastergiou et al. 2017</a>, p. 621.

</li>

<li id="cite_note-FOOTNOTECorbet2015-15"><a href="#cite_ref-FOOTNOTECorbet2015_15-0">^</a> <a href="#CITEREFCorbet2015">Corbet 2015</a>.

</li>

<li id="cite_note-FOOTNOTEHardie20197-8-16"><a href="#cite_ref-FOOTNOTEHardie20197-8_16-0">^</a> <a href="#CITEREFHardie2019">Hardie 2019</a>, p. 7-8.

</li>

<li id="cite_note-FOOTNOTEFairhurstPerkins20217._Conclusions-17">^ <a href="#cite_ref-FOOTNOTEFairhurstPerkins20217._Conclusions_17-0">a</a> <a href="#cite_ref-FOOTNOTEFairhurstPerkins20217._Conclusions_17-1">b</a> <a href="#CITEREFFairhurstPerkins2021">Fairhurst & Perkins 2021</a>, 7. Conclusions.

</li>

<li id="cite_note-FOOTNOTEFairhurstPerkins20212._Current_Uses_of_Transport_Headers_within_the_Network-18"><a href="#cite_ref-FOOTNOTEFairhurstPerkins20212._Current_Uses_of_Transport_Headers_within_the_Network_18-0">^</a> <a href="#CITEREFFairhurstPerkins2021">Fairhurst & Perkins 2021</a>, 2. Current Uses of Transport Headers within the Network.

</li>

<li id="cite_note-FOOTNOTEFairhurstPerkins20213._Research,_Development,_and_Deployment-19"><a href="#cite_ref-FOOTNOTEFairhurstPerkins20213._Research,_Development,_and_Deployment_19-0">^</a> <a href="#CITEREFFairhurstPerkins2021">Fairhurst & Perkins 2021</a>, 3. Research, Development, and Deployment.

</li>

<li id="cite_note-FOOTNOTEArkkoHardiePaulyKühlewind20232.1._Intentional_Distribution-20"><a href="#cite_ref-FOOTNOTEArkkoHardiePaulyKühlewind20232.1._Intentional_Distribution_20-0">^</a> <a href="#CITEREFArkkoHardiePaulyKühlewind2023">Arkko et al. 2023</a>, 2.1. Intentional Distribution.

</li>

<li id="cite_note-FOOTNOTEArkkoHardiePaulyKühlewind20232.2._Control_of_the_Distribution_of_Information-21"><a href="#cite_ref-FOOTNOTEArkkoHardiePaulyKühlewind20232.2._Control_of_the_Distribution_of_Information_21-0">^</a> <a href="#CITEREFArkkoHardiePaulyKühlewind2023">Arkko et al. 2023</a>, 2.2. Control of the Distribution of Information.

</li>

<li id="cite_note-FOOTNOTEArkkoHardiePaulyKühlewind20232.3._Protecting_Information_and_Authentication-22"><a href="#cite_ref-FOOTNOTEArkkoHardiePaulyKühlewind20232.3._Protecting_Information_and_Authentication_22-0">^</a> <a href="#CITEREFArkkoHardiePaulyKühlewind2023">Arkko et al. 2023</a>, 2.3. Protecting Information and Authentication.

</li>

<li id="cite_note-FOOTNOTEArkkoHardiePaulyKühlewind20232.5._Limiting_Impact_of_Information-23"><a href="#cite_ref-FOOTNOTEArkkoHardiePaulyKühlewind20232.5._Limiting_Impact_of_Information_23-0">^</a> <a href="#CITEREFArkkoHardiePaulyKühlewind2023">Arkko et al. 2023</a>, 2.5. Limiting Impact of Information.

</li>

<li id="cite_note-FOOTNOTEArkkoHardiePaulyKühlewind20232.4._Minimize_Information-24"><a href="#cite_ref-FOOTNOTEArkkoHardiePaulyKühlewind20232.4._Minimize_Information_24-0">^</a> <a href="#CITEREFArkkoHardiePaulyKühlewind2023">Arkko et al. 2023</a>, 2.4. Minimize Information.

</li>

<li id="cite_note-FOOTNOTEArkkoHardiePaulyKühlewind20232.6._Minimum_Set_of_Entities-25"><a href="#cite_ref-FOOTNOTEArkkoHardiePaulyKühlewind20232.6._Minimum_Set_of_Entities_25-0">^</a> <a href="#CITEREFArkkoHardiePaulyKühlewind2023">Arkko et al. 2023</a>, 2.6. Minimum Set of Entities.

</li>

<li id="cite_note-FOOTNOTEThomsonPauly20213._Active_Use-26"><a href="#cite_ref-FOOTNOTEThomsonPauly20213._Active_Use_26-0">^</a> <a href="#CITEREFThomsonPauly2021">Thomson & Pauly 2021</a>, 3. Active Use.

</li>

<li id="cite_note-FOOTNOTEThomsonPauly20214._Complementary_Techniques-27"><a href="#cite_ref-FOOTNOTEThomsonPauly20214._Complementary_Techniques_27-0">^</a> <a href="#CITEREFThomsonPauly2021">Thomson & Pauly 2021</a>, 4. Complementary Techniques.

</li>

<li id="cite_note-FOOTNOTEThomsonPauly20213.1._Dependency_Is_Better-28"><a href="#cite_ref-FOOTNOTEThomsonPauly20213.1._Dependency_Is_Better_28-0">^</a> <a href="#CITEREFThomsonPauly2021">Thomson & Pauly 2021</a>, 3.1. Dependency Is Better.

</li>

<li id="cite_note-FOOTNOTETrammellKuehlewind20197-29"><a href="#cite_ref-FOOTNOTETrammellKuehlewind20197_29-0">^</a> <a href="#CITEREFTrammellKuehlewind2019">Trammell & Kuehlewind 2019</a>, p. 7.

</li>

<li id="cite_note-FOOTNOTEThomsonPauly20213.3._Falsifying_Active_Use-30">^ <a href="#cite_ref-FOOTNOTEThomsonPauly20213.3._Falsifying_Active_Use_30-0">a</a> <a href="#cite_ref-FOOTNOTEThomsonPauly20213.3._Falsifying_Active_Use_30-1">b</a> <a href="#CITEREFThomsonPauly2021">Thomson & Pauly 2021</a>, 3.3. Falsifying Active Use.

</li>

<li id="cite_note-FOOTNOTEThomsonPauly20213.4._Examples_of_Active_Use-31"><a href="#cite_ref-FOOTNOTEThomsonPauly20213.4._Examples_of_Active_Use_31-0">^</a> <a href="#CITEREFThomsonPauly2021">Thomson & Pauly 2021</a>, 3.4. Examples of Active Use.

</li>

<li id="cite_note-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017623-32"><a href="#cite_ref-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017623_32-0">^</a> <a href="#CITEREFPapastergiouFairhurstRosBrunstrom2017">Papastergiou et al. 2017</a>, p. 623.

</li>

<li id="cite_note-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017623-4-33"><a href="#cite_ref-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017623-4_33-0">^</a> <a href="#CITEREFPapastergiouFairhurstRosBrunstrom2017">Papastergiou et al. 2017</a>, p. 623-4.

</li>

<li id="cite_note-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017630-34"><a href="#cite_ref-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017630_34-0">^</a> <a href="#CITEREFPapastergiouFairhurstRosBrunstrom2017">Papastergiou et al. 2017</a>, p. 630.

</li>

<li id="cite_note-FOOTNOTECorbet2016-35"><a href="#cite_ref-FOOTNOTECorbet2016_35-0">^</a> <a href="#CITEREFCorbet2016">Corbet 2016</a>.

</li>

<li id="cite_note-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017629-36"><a href="#cite_ref-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017629_36-0">^</a> <a href="#CITEREFPapastergiouFairhurstRosBrunstrom2017">Papastergiou et al. 2017</a>, p. 629.

</li>

<li id="cite_note-FOOTNOTEThomsonPauly20213.5._Restoring_Active_Use-37"><a href="#cite_ref-FOOTNOTEThomsonPauly20213.5._Restoring_Active_Use_37-0">^</a> <a href="#CITEREFThomsonPauly2021">Thomson & Pauly 2021</a>, 3.5. Restoring Active Use.

</li>

<li id="cite_note-FOOTNOTEThomsonPauly2021A.5._TCP-38">^ <a href="#cite_ref-FOOTNOTEThomsonPauly2021A.5._TCP_38-0">a</a> <a href="#cite_ref-FOOTNOTEThomsonPauly2021A.5._TCP_38-1">b</a> <a href="#CITEREFThomsonPauly2021">Thomson & Pauly 2021</a>, A.5. TCP.

</li>

<li id="cite_note-FOOTNOTEEdelineDonnet2019175-176-39"><a href="#cite_ref-FOOTNOTEEdelineDonnet2019175-176_39-0">^</a> <a href="#CITEREFEdelineDonnet2019">Edeline & Donnet 2019</a>, p. 175-176.

</li>

<li id="cite_note-FOOTNOTEHesmansDuchenePaaschDetal20131-40"><a href="#cite_ref-FOOTNOTEHesmansDuchenePaaschDetal20131_40-0">^</a> <a href="#CITEREFHesmansDuchenePaaschDetal2013">Hesmans et al. 2013</a>, p. 1.

</li>

<li id="cite_note-FOOTNOTERybczyńska2020-41"><a href="#cite_ref-FOOTNOTERybczyńska2020_41-0">^</a> <a href="#CITEREFRybczyńska2020">Rybczyńska 2020</a>.

</li>

<li id="cite_note-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017627-42"><a href="#cite_ref-FOOTNOTEPapastergiouFairhurstRosBrunstrom2017627_42-0">^</a> <a href="#CITEREFPapastergiouFairhurstRosBrunstrom2017">Papastergiou et al. 2017</a>, p. 627.

</li>

<li id="cite_note-FOOTNOTEMcQuistinPerkinsFayed20161-43"><a href="#cite_ref-FOOTNOTEMcQuistinPerkinsFayed20161_43-0">^</a> <a href="#CITEREFMcQuistinPerkinsFayed2016">McQuistin, Perkins & Fayed 2016</a>, p. 1.

</li>

<li id="cite_note-FOOTNOTESullivan2017-44"><a href="#cite_ref-FOOTNOTESullivan2017_44-0">^</a> <a href="#CITEREFSullivan2017">Sullivan 2017</a>.

</li>

<li id="cite_note-FOOTNOTECorbet2018-45">^ <a href="#cite_ref-FOOTNOTECorbet2018_45-0">a</a> <a href="#cite_ref-FOOTNOTECorbet2018_45-1">b</a> <a href="#CITEREFCorbet2018">Corbet 2018</a>.

</li>

<li id="cite_note-FOOTNOTEThomson20212._Fixed_Properties_of_All_QUIC_Versions-46"><a href="#cite_ref-FOOTNOTEThomson20212._Fixed_Properties_of_All_QUIC_Versions_46-0">^</a> <a href="#CITEREFThomson2021">Thomson 2021</a>, 2. Fixed Properties of All QUIC Versions.

</li>

<li id="cite_note-FOOTNOTEKühlewindTrammell20222._The_Necessity_of_Fallback-47"><a href="#cite_ref-FOOTNOTEKühlewindTrammell20222._The_Necessity_of_Fallback_47-0">^</a> <a href="#CITEREFKühlewindTrammell2022">Kühlewind & Trammell 2022</a>, 2. The Necessity of Fallback.

</li>

</ol></div></div>

<div class="mw-heading mw-heading2"><h2 id="Bibliography">Bibliography</h2></div>

<ul><li><cite id="CITEREFTrammellKuehlewind2019" class="citation cs1">Trammell, Brian; Kuehlewind, Mirja (April 2019). <a rel="nofollow" class="external text" href="https://datatracker.ietf.org/doc/html/rfc8546">The Wire Image of a Network Protocol</a>. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.17487%2FRFC8546">10.17487/RFC8546</a>. <a href="Request_for_Comments" title="Request for Comments">RFC</a> <a rel="nofollow" class="external text" href="https://datatracker.ietf.org/doc/html/rfc8546">8546</a>.</cite></li>

<li><cite id="CITEREFHardie2019" class="citation cs1">Hardie, Ted, ed. (April 2019). <a rel="nofollow" class="external text" href="https://datatracker.ietf.org/doc/html/rfc8558">Transport Protocol Path Signals</a>. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.17487%2FRFC8558">10.17487/RFC8558</a>. <a href="Request_for_Comments" title="Request for Comments">RFC</a> <a rel="nofollow" class="external text" href="https://datatracker.ietf.org/doc/html/rfc8558">8558</a>.</cite></li>

<li><cite id="CITEREFThomson2021" class="citation cs1">Thomson, Martin (May 2021). <a rel="nofollow" class="external text" href="https://datatracker.ietf.org/doc/html/rfc8999">Version-Independent Properties of QUIC</a>. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.17487%2FRFC8999">10.17487/RFC8999</a>. <a href="Request_for_Comments" title="Request for Comments">RFC</a> <a rel="nofollow" class="external text" href="https://datatracker.ietf.org/doc/html/rfc8999">8999</a>.</cite></li>

<li><cite id="CITEREFFairhurstPerkins2021" class="citation cs1">Fairhurst, Gorry; Perkins, Colin (July 2021). <a rel="nofollow" class="external text" href="https://datatracker.ietf.org/doc/html/rfc9065">Considerations around Transport Header Confidentiality, Network Operations, and the Evolution of Internet Transport Protocols</a>. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.17487%2FRFC9065">10.17487/RFC9065</a>. <a href="Request_for_Comments" title="Request for Comments">RFC</a> <a rel="nofollow" class="external text" href="https://datatracker.ietf.org/doc/html/rfc9065">9065</a>.</cite></li>

<li><cite id="CITEREFThomsonPauly2021" class="citation cs1">Thomson, Martin; Pauly, Tommy (December 2021). <a rel="nofollow" class="external text" href="https://datatracker.ietf.org/doc/html/rfc9170">Long-Term Viability of Protocol Extension Mechanisms</a>. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.17487%2FRFC9170">10.17487/RFC9170</a>. <a href="Request_for_Comments" title="Request for Comments">RFC</a> <a rel="nofollow" class="external text" href="https://datatracker.ietf.org/doc/html/rfc9170">9170</a>.</cite></li>

<li><cite id="CITEREFKühlewindTrammell2022" class="citation cs1">Kühlewind, Mirja; Trammell, Brian (September 2022). <a rel="nofollow" class="external text" href="https://datatracker.ietf.org/doc/html/rfc9308">Applicability of the QUIC Transport Protocol</a>. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.17487%2FRFC9308">10.17487/RFC9308</a>. <a href="Request_for_Comments" title="Request for Comments">RFC</a> <a rel="nofollow" class="external text" href="https://datatracker.ietf.org/doc/html/rfc9308">9308</a>.</cite></li>

<li><cite id="CITEREFArkkoHardiePaulyKühlewind2023" class="citation cs1">Arkko, Jari; Hardie, Ted; Pauly, Tommy; Kühlewind, Mirja (July 2023). <a rel="nofollow" class="external text" href="https://datatracker.ietf.org/doc/html/rfc9419">Considerations on Application - Network Collaboration Using Path Signals</a>. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.17487%2FRFC9419">10.17487/RFC9419</a>. <a href="Request_for_Comments" title="Request for Comments">RFC</a> <a rel="nofollow" class="external text" href="https://datatracker.ietf.org/doc/html/rfc9419">9419</a>.</cite></li>

<li><cite id="CITEREFHondaNishidaRaiciuGreenhalgh2011" class="citation conference cs1">Honda, Michio; Nishida, Yoshifumi; Raiciu, Costin; Greenhalgh, Adam; <a href="Mark_Handley_(computer_scientist)" title="Mark Handley (computer scientist)">Handley, Mark</a>; Tokuda, Hideyuki (2011). Is It Still Possible to Extend TCP?. 2011 ACM SIGCOMM Conference on Internet Measurement. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1145%2F2068816.2068834">10.1145/2068816.2068834</a>.</cite></li>

<li><cite id="CITEREFRaiciuPaaschBarreFord2012" class="citation conference cs1">Raiciu, Costin; Paasch, Christoph; Barre, Sebastien; Ford, Alan; Honda, Michio; Duchene, Fabien; Bonaventure, Olivier; <a href="Mark_Handley_(computer_scientist)" title="Mark Handley (computer scientist)">Handley, Mark</a> (2012). <a rel="nofollow" class="external text" href="https://www.usenix.org/conference/nsdi12/technical-sessions/presentation/raiciu">How Hard Can It Be? Designing and Implementing a Deployable Multipath TCP</a>. 9th USENIX Symposium on Networked Systems Design and Implementation (NSDI 12).</cite></li>

<li><cite id="CITEREFHesmansDuchenePaaschDetal2013" class="citation conference cs1">Hesmans, Benjamin; Duchene, Fabien; Paasch, Christoph; Detal, Gregory; Bonaventure, Olivier (2013). Are TCP extensions middlebox-proof?. HotMiddlebox '13. <a href="CiteSeerX_(identifier)" class="mw-redirect" title="CiteSeerX (identifier)">CiteSeerX</a> <a rel="nofollow" class="external text" href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.679.6364">10.1.1.679.6364</a>. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1145%2F2535828.2535830">10.1145/2535828.2535830</a>.</cite></li>

<li><cite id="CITEREFCorbet2015" class="citation web cs1">Corbet, Jonathan (8 December 2015). <a rel="nofollow" class="external text" href="https://lwn.net/Articles/667059/">"Checksum offloads and protocol ossification"</a>. <a href="LWN.net" title="LWN.net">LWN.net</a>.</cite></li>

<li><cite id="CITEREFCorbet2016" class="citation web cs1">Corbet, Jonathan (20 June 2016). <a rel="nofollow" class="external text" href="https://lwn.net/Articles/691887/">"Transport-level protocols in user space"</a>. <a href="LWN.net" title="LWN.net">LWN.net</a>.</cite></li>

<li><cite id="CITEREFMcQuistinPerkinsFayed2016" class="citation conference cs1">McQuistin, Stephen; Perkins, Colin; Fayed, Marwan (July 2016). Implementing Real-Time Transport Services over an Ossified Network. 2016 Applied Networking Research Workshop. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1145%2F2959424.2959443">10.1145/2959424.2959443</a>. <a href="Hdl_(identifier)" class="mw-redirect" title="Hdl (identifier)">hdl</a>:<a rel="nofollow" class="external text" href="https://hdl.handle.net/1893%2F26111">1893/26111</a>.</cite></li>

<li><cite id="CITEREFPapastergiouFairhurstRosBrunstrom2017" class="citation journal cs1">Papastergiou, Giorgos; Fairhurst, Gorry; Ros, David; Brunstrom, Anna; Grinnemo, Karl-Johan; Hurtig, Per; Khademi, Naeem; Tüxen, Michael; Welzl, Michael; Damjanovic, Dragana; Mangiante, Simone (2017). "De-Ossifying the Internet Transport Layer: A Survey and Future Perspectives". <a href="IEEE_Communications_Surveys_%26_Tutorials" class="mw-redirect" title="IEEE Communications Surveys & Tutorials">IEEE Communications Surveys & Tutorials</a>. 19: 619–639. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FCOMST.2016.2626780">10.1109/COMST.2016.2626780</a>. <a href="Hdl_(identifier)" class="mw-redirect" title="Hdl (identifier)">hdl</a>:<a rel="nofollow" class="external text" href="https://hdl.handle.net/2164%2F8317">2164/8317</a>. <a href="S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:1846371">1846371</a>.</cite></li>

<li><cite id="CITEREFSullivan2017" class="citation web cs1">Sullivan, Nick (2017-12-26). <a rel="nofollow" class="external text" href="https://blog.cloudflare.com/why-tls-1-3-isnt-in-browsers-yet/">"Why TLS 1.3 isn't in browsers yet"</a>. The Cloudflare Blog. Retrieved 2020-03-14.</cite></li>

<li><cite id="CITEREFAmmar2018" class="citation journal cs1">Ammar, Mostafa (January 2018). "Ex Uno Pluria: The Service-Infrastructure Cycle, Ossification, and the Fragmentation of the Internet". ACM SIGCOMM Comput. Commun. Rev. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1145%2F3211852.3211861">10.1145/3211852.3211861</a>. <a href="S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:12169344">12169344</a>.</cite></li>

<li><cite id="CITEREFCorbet2018" class="citation web cs1">Corbet, Jonathan (29 January 2018). <a rel="nofollow" class="external text" href="https://lwn.net/Articles/745590/">"QUIC as a solution to protocol ossification"</a>. <a href="LWN.net" title="LWN.net">LWN.net</a>.</cite></li>

<li><cite id="CITEREFEdelineDonnet2019" class="citation conference cs1">Edeline, Korian; Donnet, Benoit (2019). A Bottom-Up Investigation of the Transport-Layer Ossification. 2019 Network Traffic Measurement and Analysis Conference (TMA). <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.23919%2FTMA.2019.8784690">10.23919/TMA.2019.8784690</a>.</cite></li>

<li><cite id="CITEREFRybczyńska2020" class="citation web cs1">Rybczyńska, Marta (13 March 2020). <a rel="nofollow" class="external text" href="https://lwn.net/Articles/814522/">"A QUIC look at HTTP/3"</a>. <a href="LWN.net" title="LWN.net">LWN.net</a>.</cite></li></ul>

<div class="mw-heading mw-heading2"><h2 id="Further_reading">Further reading</h2></div>

<ul><li><cite id="CITEREFTrammellKuehlewind2015" class="citation cs1">Trammell, Brian; Kuehlewind, Mirja, eds. (October 2015). <a rel="nofollow" class="external text" href="https://datatracker.ietf.org/doc/html/rfc7663">Report from the IAB Workshop on Stack Evolution in a Middlebox Internet (SEMI)</a>. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.17487%2FRFC7663">10.17487/RFC7663</a>. <a href="Request_for_Comments" title="Request for Comments">RFC</a> <a rel="nofollow" class="external text" href="https://datatracker.ietf.org/doc/html/rfc7663">7663</a>.</cite></li></ul></div><div><div class="zim-footer">

This article is issued from <a class="external text" title="Last edited on 2025-06-22" href="https://en.wikipedia.org/wiki/?title=Protocol_ossification&oldid=1296826686">Wikipedia</a>. The text is available under <a class="external text" href="https://creativecommons.org/licenses/by-sa/4.0/deed.en">Creative Commons Attribution-Share Alike 4.0</a> unless otherwise noted. Additional terms may apply for the media files.

</div>

</div></div>

</div>

</main>

</div>

</body></html>